From Proof nets to the Free *-Autonomous Categories
نویسندگان
چکیده
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form of graph rewriting. We show the standard results of sequentialization and strong normalization of cut elimination. In the second part of the paper we show that the identifications enforced on proofs are such that the class of two-conclusion proof nets defines the free ∗-autonomous category.
منابع مشابه
Proof nets and free semi-⋆-autonomous categories
In this paper it is proved that Girard’s proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.
متن کاملProof nets and semi-⋆-autonomous categories
In this paper it is proved that Girard's proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.
متن کاملCoherence of Proof-Net Categories
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly’s and Mac Lane’s coherence theorem for symmetric monoidal closed categories. A coherence theorem with respect to these graphs is proved for proof-net categories. Such a coherence ...
متن کاملCoherence of the Double Negation in Linear Logic
Many formulations of proof nets and sequent calculi for Classical Linear Logic (CLL) [7, 8] take it for granted that a type A is identical to its double negation A⊥⊥. On the other hand, since Seely [13], it has been assumed that ∗-autonomous categories [1, 2] are the appropriate semantic models of (the multiplicative fragment of) CLL. However, in general, in a ∗-autonomous category an object A ...
متن کاملProfunctor Semantics for Linear Logic
Linear logic is a sort of “resource-aware” logic underlying intuitionistic logic. Investigations into the proof theory of this logic typically revolve around proof nets, certain two-dimensional graphical representations of proofs. Where sequent calculus deductions enforce arbitrary distinctions between proofs and complicate these investigations, proof nets represent sequent calculus deductions ...
متن کامل